Finding Normal Integral Bases of Cyclic Number Fields of Prime Degree
نویسندگان
چکیده
منابع مشابه
On the Distribution of Cyclic Number Fields of Prime Degree
Let N Cp (X) denote the number of C p Galois extensions of Q with absolute discriminant ≤ X. A well-known theorem of Wright [1] implies that when p is prime, we have N Cp (X) = c(p)X 1 p−1 + O(X 1 p) for some positive real c(p). In this paper, we improve this result by reducing the secondary error term to O(X
متن کاملNorm-euclidean Cyclic Fields of Prime Degree
Let K be a cyclic number field of prime degree `. Heilbronn showed that for a given ` there are only finitely many such fields that are normEuclidean. In the case of ` = 2 all such norm-Euclidean fields have been identified, but for ` 6= 2, little else is known. We give the first upper bounds on the discriminants of such fields when ` > 2. Our methods lead to a simple algorithm which allows one...
متن کاملSolvability of norm equations over cyclic number fields of prime degree
Let L = Q[α] be an abelian number field of prime degree q, and let a be a nonzero rational number. We describe an algorithm which takes as input a and the minimal polynomial of α over Q, and determines if a is a norm of an element of L. We show that, if we ignore the time needed to obtain a complete factorization of a and a complete factorization of the discriminant of α, then the algorithm run...
متن کاملComputing all power integral bases in orders of totally real cyclic sextic number fields
An algorithm is given for determining all power integral bases in orders of totally real cyclic sextic number fields. The orders considered are in most cases the maximal orders of the fields. The corresponding index form equation is reduced to a relative Thue equation of degree 3 over the quadratic subfield and to some inhomogeneous Thue equations of degree 3 over the rationals. At the end of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2000
ISSN: 0747-7171
DOI: 10.1006/jsco.1999.0335